Efficient search space exploration for sketch recognition
نویسندگان
چکیده
What: Sketch recognition is a natural form of interaction that has been receiving increasing attention in the research community [4], [1], [6]. One of the challenges in sketch recognition is efficient recognition. We propose to create efficient recognition by treating sketching as a dynamic process and by deriving recognition strategies from the object models specified in the language proposed in [3].
منابع مشابه
Search Space Reduction for Farsi Printed Subwords Recognition by Position of the Points and Signs
In the field of the words recognition, three approaches of words isolation, the overall shape and combination of them are used. Most optical recognition methods recognize the word based on break the word into its letters and then recogniz them. This approach is faced some problems because of the letters isolation dificulties and its recognition accurcy in texts with a low image quality. Therefo...
متن کاملSearch Your Mobile Sketch: Improving the Ratio of Interaction to Information on Mobile Devices
A mobile device’s small interaction space and undersized keyboard can sometimes make textual input difficult and impractical. Many mobile devices are predisposed for sketching as they come with a stylus or touch-screen capabilities, and sketched icons are a natural way to label objects on such a device. In this paper we present a sketch recognition overlay in Google Maps that allows users to se...
متن کاملOffline Sketch Parsing via Shapeness Estimation
In this work, we target at the problem of offline sketch parsing, in which the temporal orders of strokes are unavailable. It is more challenging than most of existing work, which usually leverages the temporal information to reduce the search space. Different from traditional approaches in which thousands of candidate groups are selected for recognition, we propose the idea of shapeness estima...
متن کاملEfficient Point-to-Subspace Query in ℓ1: Theory and Applications in Computer Vision
Motivated by vision tasks such as robust face and object recognition, we consider the following general problem: given a collection of low-dimensional linear subspaces in a high-dimensional ambient (image) space and a query point (image), efficiently determine the nearest subspace to the query in ` distance. We show in theory that Cauchy random embedding of the objects into significantlylower-d...
متن کاملEfficient Point-to-Subspace Query in $\ell^1$: Theory and Applications in Computer Vision
Motivated by vision tasks such as robust face and object recognition, we consider the following general problem: given a collection of low-dimensional linear subspaces in a high-dimensional ambient (image) space and a query point (image), efficiently determine the nearest subspace to the query in ` distance. We show in theory that Cauchy random embedding of the objects into significantlylower-d...
متن کامل